Structure-Preserving Algorithms for Palindromic Quadratic Eigenvalue Problems Arising from Vibration of Fast Trains

نویسندگان

  • Tsung-Ming Huang
  • Wen-Wei Lin
  • Jiang Qian
چکیده

In this paper, based on Patel’s algorithm (1993), we proposed a structure-preserving algorithm for solving palindromic quadratic eigenvalue problems (QEPs). We also show the relationship between the structure-preserving algorithm and the URV-based structure-preserving algorithm by Schröder (2007). For large sparse palindromic QEPs, we develop a generalized >skew-Hamiltonian implicity-restarted shift-and-invert Arnoldi algorithm (G>SHIRA) for solving the resulting >-skew-Hamiltonian pencils. Numerical experiments show that our proposed structurepreserving algorithms perform well on the palindromic QEP arising from a finite element model of high-speed trains and rails.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structured doubling algorithms for solving g-palindromic quadratic eigenvalue problems∗

The T-palindromic quadratic eigenvalue problem (λB + λC + A)x = 0, with A,B,C ∈ Cn×n, C = C and B = A, governs the vibration behavior of trains. One way to solve the problem is to apply a structure-preserving doubling algorithm (SDA) to the nonlinear matrix equation (NME) X + BX−1A = C and “square-root” the matrix quadratic involved. In this paper, we generalize the SDA for the solution of (odd...

متن کامل

An Improved Structure- Preserving Doubling Algorithm For a Structured Palindromic Quadratic Eigenvalue Problem

In this paper, we present a numerical method to solve the palindromic quadratic eigenvalue problem (PQEP) (λA+λQ+A)z = 0 arising from the vibration analysis of high speed trains, where A, Q ∈ Cn×n have special structures: both Q and A are m × m block matrices with each block being k × k, and moreover they are complex symmetric, block tridiagonal and block Toeplitz, and also A has only one nonze...

متن کامل

Palindromic quadratization and structure-preserving algorithm for palindromic matrix polynomials of even degree

In this paper, we propose a palindromic quadratization approach, transforming a palindromic matrix polynomial of even degree to a palindromic quadratic pencil. Based on the (S + S−1)-transform and Patel’s algorithm, the structurepreserving algorithm can then be applied to solve the corresponding palindromic quadratic eigenvalue problem. Numerical experiments show that the relative residuals for...

متن کامل

A note on unimodular eigenvalues for palindromic eigenvalue problems

We consider the occurrence of unimodular eigenvalues for palindromic eigenvalue problems associated with the matrix polynomial Pn(λ) ≡ ∑n i=0Aiλ i where Ai = An−i with M∗ ≡ M , M or PMP (P 2 = I). From the properties of palindromic eigenvalues and their characteristic polynomials, we show that eigenvalues are not generically excluded from the unit circle, thus occurring quite often, except for ...

متن کامل

Solving a Structured Quadratic Eigenvalue Problem by a Structure-Preserving Doubling Algorithm

In studying the vibration of fast trains, we encounter a palindromic quadratic eigenvalue problem (QEP) (λ2AT +λQ+A)z = 0, where A,Q ∈ Cn×n and QT = Q. Moreover, the matrix Q is block tridiagonal and block Toeplitz, and the matrix A has only one nonzero block in the upperright corner. So most of the eigenvalues of the QEP are zero or infinity. In a linearization approach, one typically starts w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2008